package structures.search;

public class FibonacciSearch {

    private static final int[] dataArray1 =
        {2, 3, 3, 6, 6, 6, 7, 9, 9, 9, 10, 10, 13, 15, 15, 16, 16, 18, 19, 19};
    private static final int[] dataArray2 =
            {0, 1, 1, 2, 6, 6, 6, 8, 10, 10, 11, 13, 14, 14, 15, 15, 15, 17, 17};

    private static final int VALUE = 20;

    public static void main(String[] args) {
        // 查找数据
        int index = fibonacciSearch(dataArray1);
        if (index != -1) {
            System.out.println("---- 找到数据索引值： " + index + " ----");
        } else {
            System.out.println("---- 未找到数据 ----");
        }
    }

    private static int fibonacciSearch(int[] dataArray) {
        return -1;
    }

    private static int[] getFib(int maxSize) {
        int[] fib = new int[maxSize];
        fib[0] = 1;
        fib[1] = 1;
        for (int index = 2; index < fib.length; index++) {
            fib[index] = fib[index - 1] + fib[index - 2];
        }
        return fib;
    }
}
